An extended branch and bound algorithm for linear bilevel programming
نویسندگان
چکیده
منابع مشابه
A Branch-and-cut Algorithm for Integer Bilevel Linear Programs
We describe a rudimentary branch-and-cut algorithm for solving integer bilevel linear programs that extends existing techniques for standard integer linear programs to this very challenging computational setting. The algorithm improves on the branch-and-bound algorithm of Moore and Bard in that it uses cutting plane techniques to produce improved bounds, does not require specialized branching s...
متن کاملA Branch-and-cut Algorithm for Discrete Bilevel Linear Programs
We present a branch-and-cut algorithm for solving discrete bilevel linear programs where the upper-level variables are binary and the lower-level variables are either pure integer or pure binary. This algorithm performs local search to find improved bilevelfeasible solutions. We strengthen the relaxed node subproblems in the branch-and-cut search tree by generating cuts to eliminate all of the ...
متن کاملLinear bilevel programming solution by genetic algorithm
Bilevel programming, a tool for modeling decentralized decisions, consists of the objective of the leader at its 1rst level and that of the follower at the second level. Bilevel programming has been proved to be NP-hard problem. Numerous algorithms have been developed so far for solving bilevel programming problem. In this paper, an attempt has been made to develop an e6cient approach based on ...
متن کاملBILEVEL LINEAR PROGRAMMING WITH FUZZY PARAMETERS
Bilevel linear programming is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming with inexact parameters has been studied and a method is...
متن کاملA hybrid DE-PSO algorithm for bilevel linear programming
Bilevel programming problem (BLP) is a nested optimization problem that contains one optimization task as a constraint to another optimization task. In this paper, a hybrid differential evolution and particle swarm (DE-PSO) is proposed for solving the linear BLP, in which the hybrid strategy can efficiently prevent the premature convergence of the swarm. Finally, we use the test problems from t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2006
ISSN: 0096-3003
DOI: 10.1016/j.amc.2005.12.039